P versus NP problem - PDFSEARCH.IO - Document Search Engine

P versus NP problem
Results: 202

#	Item
161	The Rise and Fall of Knapsack Cryptosystems A. M. Odlyzko AT&T Bell Laboratories Add to Reading List Source URL: www.dtc.umn.edu Language: English - Date: 1998-04-13 22:11:38 Public-key cryptography Dynamic programming Cryptography Combinatorial optimization Mathematical optimization Merkle–Hellman knapsack cryptosystem Knapsack problem P versus NP problem Subset sum problem Theoretical computer science Computational complexity theory Applied mathematics
162	Chapter 9 Central Limit Theorem Add to Reading List Source URL: www.dartmouth.edu Language: English - Date: 2003-11-11 09:11:42 Central limit theorem Binomial distribution Normal distribution Probability theory P versus NP problem NP De Moivre–Laplace theorem Binomial probability Mathematical analysis Statistics Mathematics
163	Interactive Proofs and the Hardness of Approximating Cliques Uriel Feige ∗ Add to Reading List Source URL: web.cs.elte.hu Language: English - Date: 2007-01-10 14:31:22 Complexity classes Probabilistic complexity theory Mathematical optimization Mathematical proofs Interactive proof system NP Probabilistically checkable proof P versus NP problem MAX-3SAT Theoretical computer science Computational complexity theory Applied mathematics
164	P = NP Vinay Deolalikar HP Research Labs, Palo Alto Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2010-08-08 08:45:30 Complexity classes Mathematical optimization Finite model theory Statistical models Graphical model P versus NP problem Markov random field Boolean satisfiability problem NP Theoretical computer science Computational complexity theory Applied mathematics
165	Constraint Satisfaction: A Personal Perspective Tom´as Feder 268 Waverley St., Palo Alto, CA 94301, USA Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2006-02-09 15:48:02 Complexity classes Constraint satisfaction P versus NP problem NP-complete NP P Boolean satisfiability problem 2-satisfiability Oracle machine Theoretical computer science Computational complexity theory Applied mathematics
166	Note On total functions, existence Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2004-06-22 14:05:33 Complexity classes TFNP FNP NP PPA FP Complete PLS P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
167	The Computational Complexity Column by Lance FORTNOW Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2003-08-12 11:21:33 Complexity classes Structural complexity theory Models of computation Mathematical optimization NP-complete NP P versus NP problem Oracle machine P Theoretical computer science Computational complexity theory Applied mathematics
168	Two Proofs of Ladner’s Theorem We give two proofs of Ladner’s Theorem in this note. This note is adapted from the appendix Add to Reading List Source URL: oldblog.computationalcomplexity.org Language: English - Date: 2005-01-20 10:45:01 Structural complexity theory Mathematical optimization Complexity classes Functions and mappings P versus NP problem PP Function NP Reduction Theoretical computer science Computational complexity theory Applied mathematics
169	COMPLEXITY AND COMPLETENESS OF FINDING ANOTHER SOLUTION AND ITS APPLICATION TO PUZZLES Add to Reading List Source URL: www-imai.is.s.u-tokyo.ac.jp Language: English - Date: 2003-05-03 02:38:34 Applied mathematics NP-complete P versus NP problem EXPTIME PSPACE-complete NP P-complete P Reduction Theoretical computer science Computational complexity theory Complexity classes
170	PDF Document Add to Reading List Source URL: www.unizar.es Language: English - Date: 2009-04-13 10:34:31 Complexity classes NP P versus NP problem P Bounded-error probabilistic polynomial Time complexity Oracle machine Reduction NP-hard Theoretical computer science Computational complexity theory Applied mathematics